Efficient Analysis of Graphs with Small Minimal Separators
نویسنده
چکیده
We consider the class C of graphs whose minimal separators have a fixed bounded size. We give an O(nm)-time algorithm computing an optimal tree-decomposition of every graph in C with n vertices and m edges. Furthermore we make evident that many NP-complete problems are solvable in polynomial time when restricted to this class. Both claims hold although C contains graphs of arbitrarily large tree-width.
منابع مشابه
Invited Lecture: Silver Graphs: Achievements and New Challenges
p. 1 Invited Lecture: Online Algorithms: A Studyof Graph-Theoretic Concepts p. 10 Invited Lecture: Discrete Optimization Methods for Packing Problems in Two and Three Dimensions With Applications in the Textile and Car Manufacturing Industries p. 27 Informatica, Scuola, Communita: Uno Sguardo dall' Occhio del Ciclone p. 29 Proximity-Preserving Labeling Schemes and Their Applications p. 30 Euler...
متن کاملGraphs with complete minimal k-vertex separators
G. A. Dirac characterized chordal graphs as those in which minimal vertex separators always induce complete subgraphs. I generalize a traditional (2-)vertex separator to a k-vertex separator — meaning a set S of vertices whose removal puts k independent vertices into k separate components. Generalizing Dirac’s theorem, the {P5, 2P3}-free chordal graphs are the graphs in which minimal k-separato...
متن کاملMinimal separators in P4-sparse graphs
In this paper, we determine the minimal separators of P4-sparse graphs and establish bounds on their number. Specifically, we show that a P4-sparse graph G on n vertices and m edges has fewer than 2n/3 minimal separators of total description size at most 4m/3. The bound on the number of minimal separators is tight and is also tight for the class of cographs, a well known subclass of the P4-spar...
متن کاملEvolutionary k-way Node Separators
Small node separators for large graphs are used in a variety of ways, from divide-andconquer algorithms to efficient route planning algorithms. We present a new algorithm for finding small k-way node separators on connected undirected graphs. We use an evolutionary algorithm to combine different separators in order to generate improved offsprings with locally good parts of both parent separator...
متن کاملTrianguled and Weakly Triangulated Graphs: Simpliciality in Vertices and Edges
We introduce the notion of weak simpliciality, in order to extend to weakly triangulated graphs properties of triangulated graphs, using Hayward’s notion that a vertex in a triangulated graph behaves as an edge in a weakly triangulated graph. In particular, we use our definition of weak simplicial edge elimination ordering to bound the number of minimal separators to n+m, and derive an efficien...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999